Centralized path planning for multiple robots: Optimal decoupling into sequential plans
نویسندگان
چکیده
We develop an algorithm to decouple a multi-robot path planning problem into subproblems whose solutions can be executed sequentially. Given an external path planner for general configuration spaces, our algorithm finds an execution sequence that minimizes the dimension of the highest-dimensional subproblem over all possible execution sequences. If the external planner is complete (at least up to this minimum dimension), then our algorithm is complete because it invokes the external planner only for spaces of dimension at most this minimum. Our algorithm can decouple and solve path planning problems with many robots, even with incomplete external planners. We show scenarios involving 16 to 65 robots, where our algorithm solves planning problems of dimension 32 to 130 using a PRM planner for at most eight dimensions. 1
منابع مشابه
Subdimensional Expansion: A Framework for Computationally Tractable Multirobot Path Planning
Planning optimal paths for large numbers of robots is computationally expensive. In this thesis, we present a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded in...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملOptimal motion planning for multiple robots having independent goals
This work makes two contributions to geometric motion planning for multiple robots: i) Motion plans are computed that simultaneously optimize an independent performance measure for each robot; ii) A general spectrum is deened between decoupled and centralized planning, in which we introduce coordination along independent roadmaps. By considering independent performance measures, we introduce a ...
متن کاملOptimal Motion Planning for Multiple Robots Having Independent Goals - Robotics and Automation, IEEE Transactions on
This work makes two contributions to geometric motion planning for multiple robots: 1) motion plans are computed that simultaneously optimize an independent performance measure for each robot; 2) a general spectrum is defined between decoupled and centralized planning, in which we introduce coordination along independent roadmaps. By considering independent performance measures, we introduce a ...
متن کاملA Distributed and Optimal Motion Planning Approach for Multiple Mobile Robots
|We propose a distributed and optimal motion planning algorithm for multiple robots. The computationally expensive problem is decomposed into two modules { path planning and velocity planning. The D search method is applied in both modules, based on either geometric formulation or schedule formulation. Optimization is achieved at the individual robot level by de ning cost functions to minimize,...
متن کامل